Distance-regular graphs where the distance-d graph has fewer distinct eigenvalues

نویسندگان

  • A. E. Brouwer
  • M. A. Fiol
چکیده

Let the Kneser graph K of a distance-regular graph Γ be the graph on the same vertex set as Γ, where two vertices are adjacent when they have maximal distance in Γ. We study the situation where the Bose-Mesner algebra of Γ is not generated by the adjacency matrix of K. Let Γ be a distance-regular graph of diameter d on n vertices. Let Γi be the graph with the same vertex set as Γ where two vertices are adjacent when they have distance i in Γ. Let A be the adjacency matrix of Γ, and Ai that of Γi. We are interested in the situation where Ad has fewer distinct eigenvalues than A. In this situation the matrix Ad generates a proper subalgebra of the Bose-Mesner algebra of Γ, a situation reminiscent of imprimitivity. We survey the known examples, derive parameter conditions, and obtain strong results in what we called the ‘half antipodal’ case. Unexplained notation is as in [BCN]. The vertex set X of Γ carries an association scheme with d classes, where the i-th relation is that of having graph distance i (0 ≤ i ≤ d). All elements of the Bose-Mesner algebra A of this scheme are polynomials of degree at most d in the matrix A. In particular, Ai is a polynomial in A of degree i (0 ≤ i ≤ d). Let A have minimal idempotents Ei (0 ≤ i ≤ d). The column spaces of the Ei are common eigenspaces of all matrices in A. Let Pij be the corresponding eigenvalue of Aj , so that AjEi = PijEi (0 ≤ i, j ≤ d). Now A has eigenvalues θi = Pi1 with multiplicities mi = rkEi = trEi (0 ≤ i ≤ d). Index the eigenvalues such that θ0 > θ1 > · · · > θd. Standard facts about Sturm sequences give information on the sign pattern of the matrix P . Proposition 1 Let Γ be distance-regular, and P its eigenvalue matrix. Then row i and column i of P both have i sign changes. In particular, row d and column d consist of nonzero numbers that alternate in sign. 2 1Research supported by the Ministerio de Ciencia e Innovación, Spain, and the European Regional Development Fund under project MTM2011-28800-C02-01, and the Catalan Research Council under project 2009SGR1387.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

D-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs

The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...

متن کامل

The spectral excess theorem for distance-regular graphs having distance-d graph with fewer distinct eigenvalues

Let Γ be a distance-regular graph with diameter d and Kneser graph K = Γd, the distance-d graph of Γ. We say that Γ is partially antipodal when K has fewer distinct eigenvalues than Γ. In particular, this is the case of antipodal distance-regular graphs (K with only two distinct eigenvalues), and the so-called half-antipodal distance-regular graphs (K with only one negative eigenvalue). We prov...

متن کامل

Some results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs

Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...

متن کامل

Graphs with few distinct distance eigenvalues irrespective of the diameters

The distance matrix of a simple connected graph G is D(G) = (dij), where dij is the distance between ith and jth vertices of G. The multiset of all eigenvalues of D(G) is known as the distance spectrum of G. Lin et al.(On the distance spectrum of graphs. Linear Algebra Appl., 439:1662-1669, 2013) asked for existence of graphs other than strongly regular graphs and some complete k-partite graphs...

متن کامل

Quasi-Spectral Characterization of Strongly Distance-Regular Graphs

A graph Γ with diameter d is strongly distance-regular if Γ is distanceregular and its distance-d graph Γd is strongly regular. The known examples are all the connected strongly regular graphs (i.e. d = 2), all the antipodal distanceregular graphs, and some distance-regular graphs with diameter d = 3. The main result in this paper is a characterization of these graphs (among regular graphs with...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014